Preprocessing Techniques for QBFs
نویسندگان
چکیده
In this paper we present sQueezeBF, an effective preprocessor for QBFs that combines various techniques for eliminating variables and/or clauses. In particular sQueezeBF combines (i) variable elimination by Q-resolution and equality reduction, and (ii) clause simplification via subsumption and self-subsumption resolution. The experimental analysis shows that sQueezeBF can produce significant reductions in the number of clauses and/or variables — up to the point that some instances are solved directly by sQueezeBF — and that it can significantly improve the efficiency of a range of state-of-the-art QBF solvers — up to the point that some instances cannot be solved without sQueezeBF preprocessing.
منابع مشابه
An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide about the truth of formulas given limited computational resources. In this paper, we start from the problem of computing empirical hardness markers, i.e., features that can discriminate between hard and easy QBFs, and we e...
متن کاملHQSpre - An Effective Preprocessor for QBF and DQBF
We present our new preprocessor HQSpre, a state-of-the-art tool for simplifying quantified Boolean formulas (QBFs) and the first available preprocessor for dependency quantified Boolean formulas (DQBFs). The latter are a generalization of QBFs, resulting from adding so-called Henkin-quantifiers to QBFs. HQSpre applies most of the preprocessing techniques that have been proposed in the literatur...
متن کاملOn QBF Proofs and Preprocessing
QBFs (quantified boolean formulas), which are a superset of propositional formulas, provide a canonical representation for PSPACE problems. To overcome the inherent complexity of QBF, significant effort has been invested in developing QBF solvers as well as the underlying proof systems. At the same time, formula preprocessing is crucial for the application of QBF solvers. This paper focuses on ...
متن کاملA Unified Proof System for QBF Preprocessing
For quantified Boolean formulas (QBFs), preprocessing is essential to solve many real-world formulas. The application of a preprocessor, however, prevented the extraction of proofs for the original formula. Such proofs are required to independently validate correctness of the preprocessor’s rewritings and the solver’s result. Especially for universal expansion proof checking was not possible so...
متن کاملEvaluating QBFs via Symbolic Skolemization
We describe a novel decision procedure for Quantified Boolean Formulas (QBFs) which aims to unleash the hidden potential of quantified reasoning in applications. The Skolem theorem acts like a glue holding several ingredients together: BDD-based representations for boolean functions, search-based QBF decision procedure, and compilation-to-SAT techniques, among the others. To leverage all these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008